Polar codes in a QKD Environment
نویسنده
چکیده
Polar coding is the most recent encoding scheme in the quest for error correction codes that approaches the Shannon limit, has a simple structure, and admits fast decoders. As such, it is an interesting candidate for the quantum key distribution (QKD) protocol that normally operates at high bit error rates and requires codes that operate near the Shannon limit. This paper describes approaches that integrate Polar codes into the QKD environment and provides performance results of Polar code designs within the QKD protocol.
منابع مشابه
Polar Codes for Quantum Key Distribution
The polar codes are a class of linear block error-correcting codes transmitted over symmetric binaryinput discrete memoryless channels [1, 2, 3]. As their length N, N = 2n, increases, their performance tends to the Shannon limit. Subsequent publications (e.g., [4, 5]) have addressed practical aspects of the polar codes such as the size length, N, of a polar code that can support a specific feas...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملBlind reconciliation
Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation efficiency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close...
متن کاملKey Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography
The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuousvariable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density paritycheck (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to exte...
متن کامل